Fair decomposition of group obligations

نویسندگان

  • Natasha Alechina
  • Wiebe van der Hoek
  • Brian Logan
چکیده

We consider the problem of decomposing a group norm into a set of individual obligations for the agents comprising the group, such that if the individual obligations are fulfilled, the group obligation is fulfilled. Such an assignment of tasks to agents is often subject to additional social or organisational norms that specify permissible ways in which tasks can be assigned. An important role of social norms is that they can be used to impose ‘fairness constraints’, which seek to distribute individual responsibility for discharging the group norm in a ‘fair’ or ‘equitable’ way. We propose a simple language for this kind of fairness constraints and analyse the problem of computing a fair decomposition of a group obligation, both for non-repeating and for repeating group obligations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fair Allocation of Group Tasks According to Social Norms

We consider the problem of decomposing a group norm into a set of individual obligations for the agents comprising the group, such that if the individual obligations are fulfilled, the group obligation is fulfilled. Such an assignment of tasks to agents is often subject to additional social or organisational norms that specify permissible ways in which tasks can be assigned. An important type o...

متن کامل

Fair Distribution of Collective Obligations

In social mechanism design, obligation distribution creates individual or contractual obligations that imply a collective obligation. A distinguishing feature from group planning is that also the sanction of the collective obligation has to be distributed, for example by creating sanctions for the individual or contractual obligations. In this paper we address fairness in obligation distributio...

متن کامل

Proof obligations for specification and refinement of liveness properties under weak fairness

In this report we present a formal model of fair iteration of events in a B event system. The model is used to justify proof obligations for basic liveness properties and preservation under refinement of general liveness properties. The model of fair iteration of events uses the dovetail operator, an operator proposed in [4] to model fair choice. The proofs are mainly founded in fixpoint calcul...

متن کامل

Architectural Specifications, Proof Obligations, and Decomposition

Architectural specifications can express correctness requirements of concurrent systems at a high level without any reference to component functionality. Then proof obligations derived from such specifications can be discharged as model checking tasks in a suitable behavioral model where components are assigned their respective functionalities. This paper proposes such an approach. The architec...

متن کامل

Specification and Refinement of Access Control

We consider the extension of fair event system specifications by concepts of access control (prohibitions, user rights, and obligations). We give proof rules for verifying that an access control policy is correctly implemented in a system, and consider preservation of access control by refinement of event systems. Prohibitions and obligations are expressed as properties of traces and are preser...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Log. Comput.

دوره 27  شماره 

صفحات  -

تاریخ انتشار 2017